1 research outputs found
Network Overload due to Massive Attacks
We study the cascading failure of networks due to overload, using the
betweenness centrality of a node as the measure of its load following the
Motter and Lai model. We study the fraction of survived nodes at the end of the
cascade as function of the strength of the initial attack, measured by
the fraction of nodes , which survive the initial attack for different
values of tolerance in random regular and Erd\"os-Renyi graphs. We
find the existence of first order phase transition line on a
plane, such that if the cascade of failures lead to a very
small fraction of survived nodes and the giant component of the network
disappears, while for , is large and the giant component of the
network is still present. Exactly at the function undergoes a
first order discontinuity. We find that the line ends at critical
point ,in which the cascading failures are replaced by a
second order percolation transition. We analytically find the average
betweenness of nodes with different degrees before and after the initial
attack, investigate their roles in the cascading failures, and find a lower
bound for . We also study the difference between a localized and
random attacks